Towards Optimality in Parallel Scheduling

Towards Optimality in Parallel Job Scheduling

To keep pace with Moore’s law, chip designers have focused on increasing the number of cores per chip rather than single core performance. In turn, modern jobs are often designed to run on any number of cores. However, to effectively leverage these multi-core chips, one must address the question of how many cores to assign to each job. Given that jobs receive sublinear speedups from additional ...

The Optimality of Lept in Parallel Machine Scheduling

Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling

Towards Optimality in Constellation

Communication Theory Mini Conference Globecom 97 Towards Optimality in Constellation Labeling Richard D. Wesel, Christos Komninakis, and Xueting Liu University of California, Los Angeles, CA 90095-1594 Abstract Robust trellis codes that perform well on channels with severe, correlated fading require low rates and do not employ uncoded (pass-through) bits. For this trellis code design problem, n...

Towards Flexibility and Scalability in Parallel Job Scheduling

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a job are scheduled for simultaneous execution on a partition of a parallel computer. Gang Scheduling has many advantages, such as responsiveness, efficient sharing of resources and ease of programming. However, there are two major problems associated with gang scheduli...